Discovering Unbounded Episodes in Sequential Data

نویسنده

  • Gemma C. Garriga
چکیده

One basic goal in the analysis of time series data is to nd frequent interesting episodes i e collections of events occurring frequently together in the input sequence Most widely known work decide the interestingness of an episode from a xed user speci ed window width or interval that bounds the subsequent sequential association rules We present in this paper a more intuitive de nition that allows in turn interesting episodes to grow during the mining without any user speci ed help A convenient algorithm to e ciently discover the proposed unbounded episodes is also implemented Experimental results con rm that our approach results useful and advantageous

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mining Unbounded Episodes from Sequential Data

The discovery of frequent sequential patterns in an ordered collection of data is an important data mining issue. In this problem, we are given a sequence of events, where each event has an associated time of occurrence. One basic goal in analyzing such sequences is to nd frequent interesting episodes, i.e, collections of events occurring frequently together in the input sequence. We present a ...

متن کامل

MARBLES: Mining Association Rules Buried in Long Event Sequences

Sequential pattern discovery is a well-studied field in data mining. Episodes are sequential patterns that describe events that often occur in the vicinity of each other. Episodes can impose restrictions on the order of the events, which makes them a versatile technique for describing complex patterns in the sequence. Most of the research on episodes deals with special cases such as serial and ...

متن کامل

Efficient Discovering of Top-K Sequential Patterns in Event-Based Spatio-Temporal Data

We consider the problem of discovering sequential patterns from event-based spatio-temporal data. The dataset is described by a set of event types and their instances. Based on the given dataset, the task is to discover all significant sequential patterns denoting some attraction relation between event types occurring in a pattern. Already proposed algorithms discover all significant sequential...

متن کامل

Intensional and Extensional Semantics of Bounded and Unbounded Nondeterminism

We give extensional and intensional characterizations of nondeterministic functional programs: as structure preserving functions between biorders, and as nondeterministic sequential algorithms on ordered concrete data structures which compute them. A fundamental result establishes that the extensional and intensional representations of non-deterministic programs are equivalent, by showing how t...

متن کامل

Streaming Algorithms for Pattern Discovery over Dynamically Changing Event Sequences

Discovering frequent episodes over event sequences is an important data mining task. In many applications, events constituting the data sequence arrive as a stream, at furious rates, and recent trends (or frequent episodes) can change and drift due to the dynamical nature of the underlying event generation process. The ability to detect and track such the changing sets of frequent episodes can ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003